NOUVELLES ESTIMATIONS POUR LE GROUPEMENT LE PLUS DENSE DE SPHERES DANS UN ESPACE EUCLIDIEN A N DIMENSIONSKRICHEVER IM.1974; MAT. SBOR.; S.S.S.R.; DA. 1974; VOL. 95; NO 1; PP. 146-147; BIBL. 1 REF.Article

RECOUVREMENTS MINIMAUX DANS LES MATROIDESKEL'MANS AK; LOMONOSOV MV; POLESSKIJ VP et al.1976; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1976; VOL. 12; NO 3; PP. 94-107; BIBL. 14 REF.Article

COVERAGE PROBLEMS AND RANDOM CONVEX HULLSJEWELL NP; ROMANO JP.1982; J. APPL. PROBAB.; ISSN 0021-9002; GBR; DA. 1982; VOL. 19; NO 3; PP. 546-561; BIBL. 8 REF.Article

ON THE GREEDY HEURISTIC FOR CONTINUOUS COVERING AND PACKING PROBLEMSFISHER ML; WOLSEY LA.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 4; PP. 584-591; BIBL. 10 REF.Conference Paper

PAVAGE D'UNE SURFACE PAR DES CALISSONS ET SES APPLICATIONS A DES PROBLEMES DE DENOMBREMENT LIES AUX SUITES DE YOUNGNADDEF D.1978; MATH. APPL. INFORMAT., RAPP. RECH.; FRA; DA. 1978; NO 134; PP. 1-32; BIBL. 3 REF.Serial Issue

RANDOM COVERAGE OF THE CIRCLE AND ASYMPTOTIC DISTRIBUTIONSHUESLER J.1982; J. APPL. PROBAB.; ISSN 0021-9002; GBR; DA. 1982; VOL. 19; NO 3; PP. 578-587; BIBL. 8 REF.Article

SUR UNE APPROCHE DE LA REUNION DES ELEMENTS FONCTIONNELSBRONA II; SAMOJLOVA IP.1975; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1975; NO 6; PP. 65-73; ABS. ANGL.; BIBL. 3 REF.Article

UN ALGORITHME POUR LES PROBLEMES DE RECOUVREMENT.GONDRAN M; LAURIERE JL.1975; REV. FR. AUTOMAT. INFORMAT. RECH., OPERAT., V; FR.; DA. 1975; VOL. 9; NO 2; PP. 33-51; BIBL. 1 P.Article

RANDOM COVERAGE OF A CIRCLE WITH APPLICATIONS TO A SHADOWING PROBLEMYADIN M; ZACKS S.1982; J. APPL. PROBAB.; ISSN 0021-9002; GBR; DA. 1982; VOL. 19; NO 3; PP. 562-577; BIBL. 9 REF.Article

SUR LES PROBLEMES LIES A LA SYNTHESE DES TESTS POUR LES TABLESABDUGALIEV UA.1981; Z. VYCISL. MAT. MAT. FIZ.; ISSN 0044-4669; SUN; DA. 1981; VOL. 21; NO 3; PP. 759-765; BIBL. 3 REF.Article

GENERATION OF PRIME IMPLICANTS FROM SUBFUNCTIONS AND A UNIFYING APPROACH TO THE COVERING PROBLEM.REUSCH B.1975; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1975; VOL. 24; NO 9; PP. 924-930; BIBL. 10 REF.Article

PROBLEMES DE PARTITIONNEMENT: EXPLORATION ARBORESCENTE OU METHODE DE TRONCATURES.DELORME J; HEURGON E.1975; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., V; FR.; DA. 1975; VOL. 9; NO 2; PP. 53-65; BIBL. 9 REF.Article

A symptotically good coveringsSPENCER, J.Pacific journal of mathematics. 1985, Vol 118, Num 2, pp 575-586, issn 0030-8730Article

MINIMUM COST TREE LOCATION PROBLEMSKOLEN A.1981; ISOLDE 81. INTERNATIONAL CONFERENCE ON LOCATIONAL DECISIONS. 2/1981/SKODSBORG; DNK; LYNGBY: IMSOR; DA. 1981; PP. 217-238; BIBL. 13 REF.Conference Paper

SUR UN PROBLEME D'OPTIMISATION LIE A LA REPARTITION DES COMPOSANTS DE DIFFERENTS TYPESKOBZEVA TV.1981; IZV. AKAD. NAUK SSSR, TEH. KIBERN.; ISSN 0002-3388; SUN; DA. 1981; NO 6; PP. 29-38; BIBL. 8 REF.Article

QUELQUES PROPRIETES DES RECOUVREMENTS DE TABLES BINAIRESUSTYUZHANINOV VG.1979; KIBERNETIKA; UKR; DA. 1979; NO 4; PP. 7-15; ABS. ENG; BIBL. 10 REF.Article

BORNES POUR LES EMPILEMENTS SUR LA SPHERE ET DANS L'ESPACEKABATYANSKIJ GA; LEVENSHTEJN VI.1978; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1978; VOL. 14; NO 1; PP. 3-25; BIBL. 27 REF.Article

RECOUVREMENTS MINIMAUX ET EMPAQUETAGES MAXIMAUX DE SOUS-ENSEMBLES DE PUISSANCE (K-1) PAR DES SOUS-ENSEMBLES DE PUISSANCE KKUZYURIN NN.1977; MAT. ZAMET.; S.S.S.R.; DA. 1977; VOL. 21; NO 4; PP. 565-571; BIBL. 15 REF.Article

REVUE DE QUELQUES RESULTATS RELATIFS AUX PROBLEMES DE RECOUVREMENTSALOZHENKO AA; ASRATYAN AS; KUZYURIN NN et al.1977; METODY DISKRETN. ANAL.; SUN; DA. 1977; NO 30; PP. 46-75; BIBL. 91 REF.Article

A UNIVERSAL MAPPING PROBLEM, COVERING GROUPS AND AUTOMORPHISM GROUPS OF FINITE GROUPS.HARRIS ME.1977; ROCKY MOUNTAIN J. MATH.; U.S.A.; DA. 1977; VOL. 7; NO 2; PP. 289-295; BIBL. 6 REF.Article

USING THE SETCOVERING PROBLEM TO ASSIGN FIRE COMPANIES TO FIRE HOUSES.WALKER W.1974; OPER. RES.; U.S.A.; DA. 1974; VOL. 22; NO 2; PP. 275-277; BIBL. 3 REF.Article

A TECHNIQUE FOR THE SOLUTION OF MASSIVE SET COVERING PROBLEMS, WITH APPLICATION TO AIRLINE CREW SCHEDULING.RUBIN J.1973; TRANSPORT. SCI.; U.S.A.; DA. 1973; VOL. 7; NO 1; PP. 34-48; BIBL. 11 REF.Article

ON THE LOTTO PROBLEM = SUR LE PROBLEME DU LOTODROESBEKE F; LOREA M.1982; EUR. J. OPER. RES.; ISSN 0377-2217; NLD; DA. 1982; VOL. 11; NO 1; PP. 21-25; BIBL. 9 REF.Article

THE HIERARCHICAL SERVICE LOCATION PROBLEM = LE PROBLEME DE LOCALISATION DES SERVICES HIERARCHIQUESMOORE GC; REVELLE C.1982; MANAGE. SCI.; ISSN 0025-1909; USA; DA. 1982; VOL. 28; NO 7; PP. 775-780; BIBL. 7 REF.Article

ON CONVERGENCE OF THE COVERAGE BY RANDOM ARCS ON A CIRCLE AND THE LARGEST SPACINGHOLST L.1981; ANN. PROBAB.; ISSN 0091-1798; USA; DA. 1981; VOL. 9; NO 4; PP. 646-655; BIBL. 18 REF.Article